Complexity theory

Results: 3600



#Item
591Error detection and correction / Information retrieval / Artificial intelligence / Computational complexity theory / Universal hashing / Lipschitz continuity / Hash function / Combinatory logic / Tabulation hashing / Search algorithms / Hashing / Theoretical computer science

Compressive sensing using locality-preserving matrices Elyot Grant∗ Piotr Indyk∗ December 4, 2012

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2013-06-10 19:22:49
592Computational complexity theory / Analysis of algorithms / Mosaic / Symmetry / Tessellation / Algorithm / Time complexity / Dynamic programming / Euclidean algorithm / Theoretical computer science / Applied mathematics / Mathematics

UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 8 Due on April 3 at 3:30 p.m.

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2015-01-21 19:48:42
593Analysis of algorithms / Triangulation / Computational complexity theory / Time complexity / Algorithm / Randomized algorithm / Big O notation / Delaunay triangulation / Planar separator theorem / Theoretical computer science / Mathematics / Applied mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2013-08-11 21:51:56
594Operations research / Computational complexity theory / NP-complete problems / Job shop scheduling / Mathematical optimization / Approximation algorithm / Linear programming / Algorithm / Vertex cover / Theoretical computer science / Applied mathematics / Mathematics

CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:44:41
595Polynomials / Matroid theory / Tutte polynomial / Time complexity / IP / XTR / PP / P/poly / Bounded-error probabilistic polynomial / Theoretical computer science / Mathematics / Computational complexity theory

How hard is it to approximate the Jones polynomial? Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CAarXiv:0908.0512v2 [quant-ph] 27 Oct 2014

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-10-27 20:33:15
596Applied mathematics / Computer science / Mathematics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm

(Near) Optimal Resource-Competitive Broadcast with Jamming [Extended Abstract] Seth Gilbert∗ Valerie King

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English - Date: 2014-05-10 15:58:08
597Science / Complex systems theory / Humanitarian Futures Programme / Complexity / Governance / United Nations Environment Programme / Disaster risk reduction / Humanitarian aid / Public safety / Emergency management

Prof. Eve Mitleton-Kelly Director Complexity Research Programme London School of Economics & Senior Fellow

Add to Reading List

Source URL: blogs.cim.warwick.ac.uk

Language: English - Date: 2015-03-02 05:22:53
598Formal languages / Automata theory / Tree decomposition / Graph / Tree / Structure / Rewriting / Binary tree / Matching / Mathematics / Graph theory / Theoretical computer science

THE COMPLEXITY OF THE FIRST-ORDER THEORY OF GROUND TREE REWRITE GRAPHS ¨ STEFAN GOLLER AND MARKUS LOHREY Universit¨at Bremen, Germany

Add to Reading List

Source URL: www.informatik.uni-bremen.de

Language: English - Date: 2014-06-19 07:22:27
599Data privacy / Applied probability / Exponential mechanism / Time complexity / Differential privacy / Constructible universe / Polynomial / Negligible function / PP / Theoretical computer science / Mathematics / Computational complexity theory

When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-11-01 14:13:39
600Search algorithms / Cryptographic hash functions / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / PP / Algorithm / Hash function / Universal hashing / Theoretical computer science / Applied mathematics / Computational complexity theory

A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 2

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-07-17 18:10:56
UPDATE